Search Results

---

Abstract

---

Cite as

Peter Mathé, Klaus Ritter, and Joseph F. Traub. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 98201). Dagstuhl Seminar Report 211, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1998)

---

Copy BibTex To Clipboard

@TechReport{mathe_et_al:DagSemRep.211,
  author =	{Math\'{e}, Peter and Ritter, Klaus and Traub, Joseph F.},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 98201)}},
  pages =	{1--25},
  ISSN =	{1619-0203},
  year =	{1998},
  type = 	{Dagstuhl Seminar Report},
  number =	{211},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.211},
  URN =		{urn:nbn:de:0030-drops-150972},
  doi =		{10.4230/DagSemRep.211},
}

@TechReport{mathe_et_al:DagSemRep.211, author = {Math\'{e}, Peter and Ritter, Klaus and Traub, Joseph F.}, title = {{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 98201)}}, pages = {1--25}, ISSN = {1619-0203}, year = {1998}, type = {Dagstuhl Seminar Report}, number = {211}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.211}, URN = {urn:nbn:de:0030-drops-150972}, doi = {10.4230/DagSemRep.211}, }